SimRank*: effective and scalable pairwise similarity search based on graph topology
نویسندگان
چکیده
منابع مشابه
An Experimental Evaluation of SimRank-based Similarity Search Algorithms
Given a graph, SimRank is one of the most popular measures of the similarity between two vertices. We focus on efficiently calculating SimRank, which has been studied intensively over the last decade. This has led to many algorithms that efficiently calculate or approximate SimRank being proposed by researchers. Despite these abundant research efforts, there is no systematic comparison of these...
متن کاملFast Structural Similarity Search Based on Topology String Matching
We describe an abstract data model of protein structures by representing the geometry of proteins using spatial data types and present a framework for fast structural similarity search based on the matching of topology strings using bipartite graph matching. The system has been implemented on top of the Oracle 9i spatial database management system. The performance evaluation was conducted on 36...
متن کاملScalable Trajectory Similarity Search Based on Locations in Spatial Networks
In this paper, we propose an efficient query processing algorithm that returns the trajectory results in low search time. We limit the calculation of pairwise shortest path distances between the set of query locations and the spatial nodes, by highly reducing the preprocessing requirements. Also, we introduce a spatiotemporal similarity measure, based on which the temporal-to-spatial significan...
متن کاملStructure-Based Similarity Search with Graph Histograms
Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. In this paper, we propose an efficient and effective graph manipulation technique that can be used in graph-based similarity search. Given a query graph Gq(V;E), we would like to determine fast which are the graphs in the database that are simi...
متن کاملScalable Nearest Neighbor Search based on kNN Graph
Nearest neighbor search is known as a challenging issue that has been studied for several decades. Recently, this issue becomes more and more imminent in viewing that the big data problem arises from various fields. In this paper, a scalable solution based on hill-climbing strategy with the support of k-nearest neighbor graph (kNN) is presented. Two major issues have been considered in the pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The VLDB Journal
سال: 2019
ISSN: 1066-8888,0949-877X
DOI: 10.1007/s00778-018-0536-3